CP3: Robust, Output-sensitive Display of Convex Polyhedra in Scanline Mode

نویسندگان

  • Ella Barkan
  • Dan Gordon
چکیده

A new technique is developed for displaying disjoint convex polyhedra. The method has the following properties: It is output-sensitive, displays the objects in scanline mode, and it is naturally robust. There is no complex data structure uniting the different polyhedra, so dynamic insertions and deletions are simple. Its robustnes is based on a novel method of comparing depths by representative “axes” of objects instead of surfaces. The method is based on two extensions of the “critical-points” method for polygon scan conversion: One extension allows the efficient display of planar graphs in scanline mode, and another extension is into the third dimension. Test runs indicate that it compares extremely favorably with other methods that operate in scanline mode, as well as with standard software and hardware techniques of medium-level workstations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Controller Design Based on Sliding Mode Observer in The Presence of Uncertainties and Actuator Saturation

This paper studies the design of a robust output feedback controller subject to actuator saturation. For this purpose, a robust high-gain sliding mode observer is used to estimate the state variables. Moreover, the combination of Composite Nonlinear Feedback (CNF) and Integral Sliding Mode (ISM) controllers are used for robust output tracking. This controller consists of two parts, the CNF part...

متن کامل

Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications

We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative p...

متن کامل

Measuring robust overall profit efficiency with uncertainty in input and output price vectors

The classic overall profit needs precise information of inputs, outputs, inputs and outputs price vectors. In real word, all data are not certain. Therefore, in this case, stochastic and fuzzy methods use for measuring overall profit efficiency. These methods require more information about the data such as probability distribution function or data membership function, which in some cases may no...

متن کامل

Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces

We present the first exact and robust implementation of the 3D Minkowski sum of two non-convex polyhedra. Our implementation decomposes the two polyhedra into convex pieces, performs pairwise Minkowski sums on the convex pieces, and constructs their union. We achieve exactness and the handling of all degeneracies by building upon 3D Nef polyhedra as provided by Cgal. The implementation also sup...

متن کامل

Modelling Decision Problems Via Birkhoff Polyhedra

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2001